Graphic sequences with a realization containing a generalized friendship graph
نویسندگان
چکیده
منابع مشابه
Graphic sequences with a realization containing a generalized friendship graph
Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451–460) considered a variation of the classical Turán-type extremal problems as follows: for any simple graph H, determine the smallest even integer σ(H, n) such that every n-term graphic sequence π = (d1, d2, . . . , dn) with term sum σ(π) = d1 + d2 + · · ·+ dn ≥ σ(H, n) has a realization G containing H as a s...
متن کاملGraphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H,n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex graph G witnessing π that contains H as a weak subgraph. Let Fk denote the friendship graph on 2k+1 vertices, that is, the graph of k triangles intersecting in a single vertex. In this paper, for n sufficiently large, σ(...
متن کاملGraphic sequences with a realization containing a complete multipartite subgraph
A nonincreasing sequence of nonnegative integers π = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence π. In this case, G is said to realize π. For a given graph H, a graphic sequence π is potentially H-graphic if there is some realization of π containing H as a (weak) subgraph. Let σ(π) denote the sum of the terms of π. For a graph H and n ∈ Z+, σ(H,...
متن کاملGraphic Sequences with a Realization Containing a Union of Cliques
An integer sequence π is said to be graphic if it is the degree sequence of some simple graph G. In this case we say that G is a realization of π. Given a graph H, and a graphic sequence π we say that π is potentially H-graphic if there is some realization of π that contains H as a subgraph. We define σ(H, n) to be the minimum even integer such that every graphic sequence with sum at least σ(H,...
متن کاملconnected graphs cospectral with a friendship graph
let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.11.075